Asymptotic Density in Combined Number Systems
نویسنده
چکیده
Necessary and sufficient conditions are found for a combination of additive number systems and a combination of multiplicative number systems to preserve the property that all partition sets have asymptotic density. These results cover and extend several special cases mentioned in the literature and give partial solutions to two problems in [6].
منابع مشابه
Asymptotic Behaviors of Nearest Neighbor Kernel Density Estimator in Left-truncated Data
Kernel density estimators are the basic tools for density estimation in non-parametric statistics. The k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in which the bandwidth is varied depending on the location of the sample points. In this paper, we initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...
متن کاملSome Asymptotic Results of Kernel Density Estimator in Length-Biased Sampling
In this paper, we prove the strong uniform consistency and asymptotic normality of the kernel density estimator proposed by Jones [12] for length-biased data.The approach is based on the invariance principle for the empirical processes proved by Horváth [10]. All simulations are drawn for different cases to demonstrate both, consistency and asymptotic normality and the method is illustrated by ...
متن کاملDirichlet Density Extends Asymptotic Density in Multiplicative Systems
Abstract. Dirichlet density extends global asymptotic density in an additive number system A whose generating series A(x) diverges at its radius of convergence (see [1], p. 50). This note shows that the parallel result holds for a multiplicative number system A, namely if the abcissa of convergence α of the generating series A(x) is finite and A(α) = ∞ then Dirichlet density extends global asym...
متن کاملAsymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملOn asymptotic stability of Prabhakar fractional differential systems
In this article, we survey the asymptotic stability analysis of fractional differential systems with the Prabhakar fractional derivatives. We present the stability regions for these types of fractional differential systems. A brief comparison with the stability aspects of fractional differential systems in the sense of Riemann-Liouville fractional derivatives is also given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002